Minimum-storage regenerating codes resistant to special adversary

Introduction: In order to deal with temporarily unavailable nodes in a distributed storage system, engineers apply special classes of erasure correction codes. These codes allow you repair node by downloading small amounts data from the remaining ones. However, this creates safety threats presence an eavesdropper. Purpose: Introducing new mathematical model which eavesdropper has limited access all and developing resistant it. Methods: Information-theoretic arguments, mixing information symbols random ones systematic Reed — Solomon code. Results: We introduced system. Note that proposed is passive, being unable change accessed data. found parameters for optimal regenerating such adversary, provided technique ensure necessary resistance. As result, we obtained construction minimum adversary. Practical relevance: The constructions can provide resistance adversary while ensuring effective repair.